منابع مشابه
Scaling Laplacian Pyramids
Laplacian pyramid based Laurent polynomial (LP2) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate when such matrices are scalable, that is when right multiplication by Laurent polynomial diagonal matrices results in paraunitary matrices. The notion of scala...
متن کاملAuto-adaptative Laplacian Pyramids for high-dimensional data analysis
Non-linear dimensionality reduction techniques such as manifold learning algorithms have become a common way for processing and analyzing high-dimensional patterns that often have attached a target that corresponds to the value of an unknown function. Their application to new points consists in two steps: first, embedding the new data point into the low dimensional space and then, estimating th...
متن کاملLaplacian Growth, Sandpiles and Scaling Limits
Laplacian growth is the study of interfaces that move in proportion to harmonic measure. Physically, it arises in fluid flow and electrical problems involving a moving boundary. We survey progress over the last decade on discrete models of (internal) Laplacian growth, including the abelian sandpile, internal DLA, rotor aggregation, and the scaling limits of these models on the lattice Z as the ...
متن کاملMulti-resolution Representation of Multifocus Image Fusion Using Gaussian and Laplacian Pyramids
Image Processing is the integral part of the surveillance system. Multifocus image fusion is a technique used to fuse multiple images captured with multiple focal lengths. In this paper we have studied the multi-resolution pyramid method used to integrate the multiple multifocus images together. This method is based on the down sampling and up sampling of the images and to apply various operati...
متن کاملAccurate Banded Graph Cut Segmentation of Thin Structures Using Laplacian Pyramids
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptable amount of storage and computation time is required for the large images/volumes common in medical applications. The Banded Graph Cut (BGC) algorithm was proposed to drastically increase the computational speed of Gr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2015
ISSN: 0895-4798,1095-7162
DOI: 10.1137/140988231